Environment Characterization for Non-recontaminating Frontier-Based Robotic Exploration
نویسندگان
چکیده
This paper addresses the problem of obtaining a concise description of a physical environment for robotic exploration. We aim to determine the number of robots required to clear an environment using non-recontaminating exploration. We introduce the medial axis as a configuration space and derive a mathematical representation of a continuous environment that captures its underlying topology and geometry. We show that this representation provides a concise description of arbitrary environments, and that reasoning about points in this representation is equivalent to reasoning about robots in physical space. We leverage this to derive a lower bound on the number of required pursuers. We provide a transformation from this continuous representation into a symbolic representation. Finally, we present a generalized pursuit-evasion algorithm. Given an environment we can compute how many pursuers we need, and generate an optimal pursuit strategy that will guarantee the evaders are detected with the minimum
منابع مشابه
Quick Goal Seeking Algorithm for Frontier based Robotic Navigation
There arises situations where an autonomous robot needs to navigate to a target location and no information is available about the terrain. Frontier based navigation is one of the most efficient methods of exploration and navigation for such situations. In a frontier based strategy, the robot navigates to the target location by detecting intermediate frontier regions, which are points lying on ...
متن کاملFrontier Based Multi Robot Area Exploration Using Prioritized Routing
The paper deals with multi-robot centralized autonomous area exploration of unknown environment with static obstacles. A simple reasoning algorithm based on preassignment of routing priority is proposed. The algorithm tracks the frontiers and assigns the robots to the frontiers when the robots fall into a trap situation. The algorithm is simulated with various multi-robotic configurations in di...
متن کاملDeployment Algorithms for Multi-Agent Exploration and Patrolling
Exploration and patrolling are central themes in distributed robotics. These deployment scenarios have deep fundamental importance in robotics, beyond the most obvious direct applications, as they can be used to model a wider range of seemingly unrelated deployment objectives. Deploying a group of robots, or any type of agent in general, to explore or patrol in dynamic or unknown environments p...
متن کاملA Cognitive Agent-based Model for Multi-Robot Coverage ata City Scale
Background Multi-robot system (MRS) has emerged as a product of cheap sensing and actuating capabilities of small, and moderately sophisticated robots and advancements in distributed problem-solving. In application domains such as sweeping, distribution and exploration of an unknown environment, MRS usually have mobile and autonomous participating robots, performing the task cooperatively. It h...
متن کاملExploration in Information Distribution Maps
In this paper, a novel solution for autonomous robotic exploration is proposed. We model the distribution of information in an unknown environment as an unsteady diffusion process, which can be an appropriate mathematical formulation and analogy for expanding, time-varying, and dynamic environments. This information distribution map is the solution of the diffusion process partial differential ...
متن کامل